Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates
نویسنده
چکیده
We consider depth-3 unbounded fanin threshold circuits. Gates are usual threshold functions T n k which compute 1 ii at least k of the inputs are equal to 1; the minimum minfk; n ? k + 1g is the threshold value of this gate. We show that the function T n k cannot be computed by a small depth-3 threshold circuit with threshold values of its gates much smaller than k:
منابع مشابه
A Comparison of the Computational Power of Sigmoid and Boolean Threshold Circuits
We examine the power of constant depth circuits with sigmoid (i.e. smooth) threshold gates for computing boolean functions. It is shown that, for depth 2, constant size circuits of this type are strictly more powerful than constant size boolean threshold circuits (i.e. circuits with linear threshold gates). On the other hand it turns out that, for any constant depth d, polynomial size sigmoid t...
متن کاملOn the Computational Power of Sigmoid versus Boolean Threshold Circuits
We examine the power of constant depth circuits with sigmoid (i.e. smooth) threshold gates for computing boolean functions. It is shown that, for depth 2, constant size circuits of this type are strictly more powerful than constant size boolean threshold circuits (i.e. circuits with boolean threshold gates). On the other hand it turns out that, for any constant depth d , polynomial size sigmoid...
متن کاملAverage-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
We show average-case lower bounds for explicit Boolean functions against bounded-depth thresh-old circuits with a superlinear number of wires. We show that for each integer d > 1, there isεd > 0 such that Parity has correlation at most 1/nΩ(1) with depth-d threshold circuits whichhave at most n1+εd wires, and the Generalized Andreev Function has correlation at most 1/2nwith ...
متن کاملOn Small Depth Threshold Circuits
In this talk we will consider various classes defined by small depth polynomial size circuits which contain threshold gates and parity gates. We will describe various inclusions between many classes defined in this way and also classes whose definitions rely upon spectral properties of Boolean functions.
متن کاملThe Complexity of Computing Symmetric Functions Using Threshold Circuits
Beame, R., E. Brisson and R. Ladner, The complexity of computing symmetric functions using threshold circuits, Theoretical Computer Science 100 (1992) 2533265. This paper considers size-depth tradeoffs for threshold circuits computing symmetric functions. The size measure used is the number of connections or edges in the threshold circuits as opposed to the number of gates in the circuits. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 56 شماره
صفحات -
تاریخ انتشار 1995